Are two given elements neighbouring?
نویسندگان
چکیده
منابع مشابه
A generalization of the probability that the commutator of two group elements is equal to a given element
The probability that the commutator of two group elements is equal to a given element has been introduced in literature few years ago. Several authors have investigated this notion with methods of the representation theory and with combinatorial techniques. Here we illustrate that a wider context may be considered and show some structural restrictions on the group.
متن کاملAre two given maps homotopic? An algorithmic viewpoint
This paper presents two algorithms. In their simplest form, the first algorithm decides the existence of a pointed homotopy between given simplicial maps f , g : X → Y and the second computes the group [ΣX, Y ] * of pointed homotopy classes of maps from a suspension; in both cases, the target Y is assumed simply connected and the algorithms run in polynomial time when the dimension of X is fixe...
متن کاملWhich elements of a finite group are non-vanishing?
Let $G$ be a finite group. An element $gin G$ is called non-vanishing, if for every irreducible complex character $chi$ of $G$, $chi(g)neq 0$. The bi-Cayley graph ${rm BCay}(G,T)$ of $G$ with respect to a subset $Tsubseteq G$, is an undirected graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(tx,2)}mid xin G, tin T}$. Let ${rm nv}(G)$ be the set of all non-vanishi...
متن کاملModels of PA: when two elements are necessarily order automorphic
We are interested in the question of how much the order of a non-standard model of PA can determine the model. In particular, for a model M , we want to characterize the complete types p(x, y) of non-standard elements (a, b) such that the linear orders {x : x < a} and {x : x < b} are necessarily isomorphic. It is proved that this set includes the complete types p(x, y) such that if the pair (a,...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1982
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90059-0